Bi-objective parallel machine scheduling with additional resources during setups

We present a bi-objective parallel machine scheduling problem with and job sequence dependent setup times, the additional consideration of resources needed during setups. The availability such is limited. This models many practical situations where times imply, for example, cleaning and/or reconfiguration productive equipment. These setups are performed by personnel, who course limited in number. objectives considered minimization makespan number resources. Fewer available reduce production costs but inevitably increase makespan. On contrary, greater allow more to be done reduced An algorithm based on iterated greedy approaches proposed search Pareto front problem. compared state-of-the art methods adapted Computational experiments, supported statistical analyses, indicate that approach outperforms all other tested procedures.